Positive tree representations and applications to tree automataBOZAPALIDIS, S.Information and computation (Print). 1997, Vol 139, Num 2, pp 130-153, issn 0890-5401Article

The closure under division and a characterization of the recognizable Z-subsetsKOBAYASHI, N.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 3, pp 209-230, issn 0988-3754Article

Note on node-rewriting graph grammarsKREOWSKI, H.-J; ROZNBERG, G.Information processing letters. 1984, Vol 18, Num 1, pp 21-24, issn 0020-0190Article

Construction et utilisation d'un modèle fonctionnel à un pas d'automate asynchroneBAJDA, V. D; MATROSOVA, A. YU.Avtomatika i telemehanika. 1984, Num 5, pp 117-124, issn 0005-2310Article

Sur les automates circulaires et la conjecture de ČernÝ = On circular automata and ČernÝ conjectureDUBUC, L.Informatique théorique et applications (Imprimé). 1998, Vol 32, Num 1-3, pp 21-34, issn 0988-3754Article

Two-way automaton computationsBIRGET, J.-C.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 1, pp 47-66, issn 0988-3754, 20 p.Article

A note on fairness in I/O automataROMIJN, J; VAANDRAGER, F.Information processing letters. 1996, Vol 59, Num 5, pp 245-250, issn 0020-0190Article

«Automates et contraintes ensemblistes» = «Automata and set constraints»Tommasi, Marc; Tison, Sophie.1994, 138 p.Thesis

Varieties of finite monoids and Büchi-McNaughton theoremDO LONG VAN; PHAN TRUNG HUY.Theoretical computer science. 1992, Vol 98, Num 2, pp 321-337, issn 0304-3975Article

Infinitary tree languages recognized by ω-automataSAOUDI, A.Information processing letters. 1984, Vol 18, Num 1, pp 15-19, issn 0020-0190Article

Automata and currencyPRIESE, L.Theoretical computer science. 1983, Vol 25, Num 3, pp 221-265, issn 0304-3975Article

Implementation and Application of AutomataIBARRA, Oscar H.Theoretical computer science. 2004, Vol 328, Num 1-2, issn 0304-3975, 222 p.Conference Proceedings

Surjective linear cellular automata over Z_mSATO, T.Information processing letters. 1998, Vol 66, Num 2, pp 101-104, issn 0020-0190Article

On lindenmayerian rational subsets of monoidsHONKALA, J.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 1, pp 81-96, issn 0988-3754Article

Rice's theorem for the limit sets of cellular automataKARI, J.Theoretical computer science. 1994, Vol 127, Num 2, pp 229-254, issn 0304-3975Article

Algorithmes de décomposition des automates finis suivant un critère de coordonnéeSIMONOV, V. M.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 3, pp 216-222, issn 0002-3388Article

Quasi-variétés d'automates. Relations avec les quasigroupesGVARAMIYA, A. A.Sibirskij matematičeskij žurnal. 1985, Vol 26, Num 3, pp 11-30, issn 0037-4474Article

Processus dynamiques dans les automates à actions périodiques. I. Actions primitivesLEVIN, V. I.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 4, pp 128-134, issn 0002-3388Article

Le système de programmation structurée Hexel = Hexel structured programming systemHERRERA MIRANDA, J.Revue technique - Thomson-CSF. 1984, Vol 16, Num 1, pp 99-120, issn 0035-4279Article

Proceedings/Advanced research workshop on disordered systems and biological organization, Les Houches, February 25-March 8, 1985BIENENSTOCK, E; FOGELMAN SOULIE, F; WEISBUCH et al.NATO ASI series. Series F : computer and system sciences. 1986, Vol 20, issn 0258-1248, XXI-405 pConference Proceedings

Computation of partial automata through span compositionGIRARDI ROGGIA, Karina; AUGUSTO HOFF, Marnes; BLAUTH MENEZES, Paulo et al.Lecture notes in computer science. 2005, pp 15-20, issn 0302-9743, isbn 3-540-29002-8, 1Vol, 6 p.Conference Paper

Trade-off results for connection managementMAVRONICOLAS, M; PAPADAKIS, N.Lecture notes in computer science. 1997, pp 340-351, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Separating words with machines and groupsROBSON, J. M.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 1, pp 81-86, issn 0988-3754Article

Enzymes as molecular automata : a reflection on some numerical and philosophical aspects of the hypothesisMARIJUAN, P. C; WESTLEY, J.Biosystems. 1992, Vol 27, Num 2, pp 97-113, issn 0303-2647Article

Left ideals and reachability in machinesHOFER, G.Theoretical computer science. 1989, Vol 68, Num 1, pp 49-56, issn 0304-3975Article